On numerical stability of recursive present value computation method
نویسنده
چکیده
We analyze numerical stability of a recursive computation scheme of present value (PV) amd show that the absolute error increases exponentially for positive discount rates. We show that reversing the direction of calculations in the recurrence equation yields a robust PV computation routine.
منابع مشابه
On Numerical (in)stability of Recursive Present Value Computation Method
We show that the recursive computation scheme of present value (PV), which is used implicitly in FAS 91 accounting standard, is numerically unstable and that the absolute error increases exponentially for positive discount rates. We show that reversing the direction of calculations in the recurrence equation yields a robust PV computation routine.
متن کاملHIERARCHICAL COMPUTATION OF HERMITE SPHERICAL INTERPOLANT
In this paper, we propose to extend the hierarchical bivariateHermite Interpolant to the spherical case. Let $T$ be an arbitraryspherical triangle of the unit sphere $S$ and let $u$ be a functiondefined over the triangle $T$. For $kin mathbb{N}$, we consider aHermite spherical Interpolant problem $H_k$ defined by some datascheme $mathcal{D}_k(u)$ and which admits a unique solution $p_k$in the ...
متن کاملRecursive Factorization Method for the Paraperspective Model Based on the Perspective Projection
The factorization method, which allows us to reconstruct the motion of the camera and shape of the object simultaneously from multiple images, provides high stability in numerical computations and satisfactory results. To apply this method to real-time processing, the recursive factorization method has been proposed. However, factorization method based on the affine projection has a limitation ...
متن کاملMathematical Modeling of Gas Adsorption Processes in Packed Bed: The Role of Numerical Methods on Computation Time
Rigorous mathematical modeling of adsorption processes in packed beds involves time-consuming computations which are considered as the fundamental weakness of such thorough mathematical models. Thus, reducing the computation time was a key factor in improving adsorption mathematical models. In order to achieve this goal, an attempt was made to know how much using different numerical methods inf...
متن کاملNumerical stability of fast computation algorithms of Zernike moments
A detailed, comparative study of the numerical stability of the recursive algorithms, widely used to calculate the Zernike moments of an image, is presented in this paper. While many papers, introducing fast algorithms for the computation of Zernike moments have been presented in the literature, there is not any work studying the numerical behaviour of these methods. These algorithms have been ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0611049 شماره
صفحات -
تاریخ انتشار 2006